K-Harmonic means data clustering with tabu-search method
نویسندگان
چکیده
منابع مشابه
K-Means Clustering using Tabu Search with Quantized Means
The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd’s algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational complexity. Moreover, the difficulty in parameter selection in the existing TS...
متن کاملK-harmonic Means Data Clustering with Imperialist Competitive Algorithm
Data clustering is one of the most important tasks of data mining. This paper aims to describe an integrated data clustering method based on Imperialist Competitive Algorithm (ICA) and K-Harmonic Means (KHM) algorithm. The proposed method is called ICA-KHM. KHM is a well-known clustering method and its main drawback is to converge to local optimums. Imperialist competitive algorithm is an evolu...
متن کاملGeneticTKM: A Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means
The clustering problem under the criterion of minimum sum square of errors is a non-convex and nonlinear problem, which possesses many locally optimal values, resulting that its solution often being stuck at locally optimal solution. In this paper, a hybrid genetic, tabu search and k-means algorithm, called GeneticTKM, is proposed for the clustering problem. A new mutation operator is presented...
متن کاملA Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means
The clustering problem under the criterion of minimum sum square of errors is a non-convex and non-linear problem, which possesses many locally optimal values, resulting that its solution often being stuck at locally optimal solution. In this paper, a hybrid genetic, tabu search and k-means algorithm, called GeneticTKM, is proposed for the clustering problem. A new mutation operator is presente...
متن کاملVariable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2008
ISSN: 0307-904X
DOI: 10.1016/j.apm.2007.03.011